A Boltzmann machine optimizing dynamic routing for FANETs

Routing optimization for FANETs is a kind of NP-hard problem in the field combinatorial that simple to model but difficult solve. The quality routing has direct impact on network FANETs, and design protocols becomes very challenging topic. In this paper, we study characteristics dynamic routing, combine themselves, use energy nodes, bandwidth, link stability, etc., as metric Boltzmann machine search form an optimized protocol. NS3 simulator used compare traditional MANET methods AODV DSR, simulation results show routes obtained by using are better than those DSR many aspects, such end-to-end average delay, route survival time control overhead.